Punctured Syndrome Decoding Problem

نویسندگان

چکیده

Among the fourth round finalists of NIST post-quantum cryptography standardization process for public-key encryption algorithms and key encapsulation mechanisms, three rely on hard problems from coding theory. Key mechanisms are frequently used in hybrid cryptographic systems: a algorithm exchange secret communication. A major point is thus initial that performed thanks to mechanism. In this paper, we analyze side-channel vulnerabilities mechanism implemented by Classic McEliece cryptosystem, whose security based syndrome decoding problem. We use leakages reduce complexity problem reducing length code considered. The columns punctured original This approach leads efficient profiled attacks recover session with high success rates, even noisy scenarios.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes

Punctured Reed-Solomon (RS) and Gabidulin (G) codes over the field Fqm with locators from the subfield Fq can be represented as interleaving of m correspondent codes over the subfield Fq or can be considered as virtual interleaving of m correspondent codes over the field Fqm . Using a probabilistic unique syndrome decoder, m-interleaved or virtually interleaved codes can be decoded up to the sa...

متن کامل

Soft-decision decoding using punctured codes

Let a -ary linear ( )-code be used over a memoryless channel. We design a soft-decision decoding algorithm that tries to locate a few most probable error patterns on a shorter length [ ]. First, we take cyclically consecutive positions starting from any initial point. Then we cut the subinterval of length into two parts and examine most plausible error patterns on either part. To obtain codewor...

متن کامل

Bounds on the decoding complexity of punctured codes on graphs

We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. This is in contrast to all previous constructions of capacity-achieving sequences of ensembles whose complexity grows at least like the log of the...

متن کامل

Matched Decoding for Punctured Convolutional Encoded Transmission Over ISI-Channels

Matched decoding is a technique that enables the efficient maximum-likelihood sequence estimation of convolutionally encoded PAM-transmission over ISI-channels. Recently, we have shown that the super-trellis of encoder and channel can be described with significantly fewer states without loss in Euclidean distance, by introducing a non-linear representation of the trellis. This paper extends the...

متن کامل

Efficient list decoding of punctured Reed-Muller codes

The Reed-Muller (RM) code encoding n-variate degree-d polynomials over Fq for d < q, with its evaluation on Fq , has relative distance 1− d/q and can be list decoded from a 1−O( √ d/q) fraction of errors. In this work, for d ≪ q, we give a length-efficient puncturing of such codes which (almost) retains the distance and list decodability properties of the Reed-Muller code, but has much better r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2023

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-29497-6_9